Higher-order matching polynomials and d-orthogonality

HIGHER ORDER MATCHING POLYNOMIALS AND d-ORTHOGONALITY

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre poly...

Algebraic Higher-Order Matching

The decidability of algebraic higher-order matching is proved. Algebraic higher-order matching is a matching where the constant term in equation is built of first-order constants and constants of a base type. This result is particularly appealing in the light of the last result of Loader.

Higher-Order Matching and Games

Higher-order Changhee Numbers and Polynomials

In this paper, we consider the higher-order Changhee numbers and polynomials which are derived from the fermionic p-adic integral on Zp and give some relations between higher-order Changhee polynomials and special polynomials. 366 Dae San Kim, Taekyun Kim, Jong Jin Seo and Sang-Hun Lee

-Genocchi Polynomials and Numbers of Higher Order

Copyright q 2010 Lee-Chae Jang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We investigate several arithmetic properties of h, q-Genocchi polynomials and numbers of higher order.